Symmetry Breaking and Branching Constraints
نویسندگان
چکیده
Symmetry breaking is the process of eliminating redundant search by taking advantage of the symmetries in a problem. Symmetry breaking techniques can be combined with other search heuristics, such as branching constraints and variable orderings. The interaction between dynamic symmetry breaking and domain splitting is discussed, and preliminary results are presented showing the impact of variable ordering on dynamic and static symmetry breaking.
منابع مشابه
An Adaptive Model Restarts Heuristic
Symmetry is an important but often problematic feature of constraint satisfaction problems. One way to deal with symmetry is to add constraints to eliminate symmetric solutions [1–7]. Posting static symmetry breaking constraints has both good and bad features. On the positive side, static constraints are easy to post, and a few simple constraints can eliminate most symmetry in a problem. On the...
متن کاملDynamic Symmetry Breaking Constraints
We present a general method for dynamically posting symmetry breaking constraints during search. The basic idea is very simple. Given any set of symmetry breaking constraints, if during search a symmetry of one of these constraints is entailed and this is consistent with previously posted symmetry breaking constraints, then we post this constraint. We illustrate the method with two examples whe...
متن کاملPosting Static Symmetry Breaking Constraints Dynamically
Symmetry is an important feature of many combinatorial search problems. We propose a new method for dynamically posting static symmetry breaking constraints during search. This method is based on the observations that any symmetry of a set of symmetry breaking constraints can be used to break symmetry, and different symmetries pick out different solutions. We choose which symmetry to post as br...
متن کاملDynamic Posting of Static Symmetry Breaking Constraints∗
We have proposed a method for dynamically posting symmetry breaking constraints to eliminate value interchangeability [1]. We now extend this method to work with any type of symmetry breaking constraint for any type of symmetry. We prove that this method is correct in general. That is, it only eliminates symmetric solutions. We also identify some simple conditions when it eliminates all symmetr...
متن کاملSymmetries of Symmetry Breaking Constraints
Symmetry is an important feature of many constraint programs. We show that any problem symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry class. This simple but powerful idea can be used in a number of different ways. We describe one application within model restarts, a search technique desi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008